Combinatorial Determinant Formulas for Boubaker Polynomials
نویسندگان
چکیده
منابع مشابه
On Combinatorial Formulas for Macdonald Polynomials
A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of so-called alcove walks; these originate in the work of Gaussent-Littelmann and ...
متن کاملCombinatorial formulas for double parabolic R-polynomials
The well-known R-polynomials in Z[q], which appear in Hecke algebra computations, are closely related to certain modified R-polynomials in N[q] whose coefficients have simple combinatorial interpretations. We generalize this second family of polynomials, providing combinatorial interpretations for expressions arising in a much broader class of computations. In particular, we extend results of B...
متن کاملA Unified Approach to Combinatorial Formulas for Schubert Polynomials
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials; we also present simplifications in some of the existing approaches to this area. We designate certain line diagrams known as rc-graphs as the main structure...
متن کاملCombinatorial Formulas for Macdonald and Hall-Littlewood Polynomials
A breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of the corresponding affine Weyl group. In this paper, we show that a Haglund-Haiman-Loehr type formula...
متن کاملSome combinatorial formulas for the partial r-Bell polynomials
The partial r-Bell polynomials generalize the classical partial Bell polynomials (coinciding with them when r = 0) by assigning a possibly different set of weights to the blocks containing the r smallest elements of a partition no two of which are allowed to belong to the same block. In this paper, we study the partial r-Bell polynomials from a combinatorial standpoint and derive several new fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2020
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2020/1528639